Morphic Search Strategies
نویسندگان
چکیده
† Also at SearchSpace Ltd., London. Abstract: This paper presents the details of a novel search strategy based on randomly remapped search spaces. The algorithm, the MultiMorphic Hill Climber (MMHC), uses multiple base changes in the encoding of potential solutions, so as to adjust the shape and form of a search problem. We describe the algorithm’s structure and present the details of the algorithm’s results on the range of real-valued test functions as defined by the IEEE First International Contest on Evolutionary Optimisation.
منابع مشابه
Morphic Computing
In this paper, we introduce a new type of computation called “Morphic Computing”. Morphic Computing is based on Field Theory and more specifically Morphic Fields. Morphic Fields were first introduced by Rupert Sheldrake [1981] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. Rupert Sheldrake [1981] developed his famous theory, Morphic Resonan...
متن کاملThe Quasi-morphic Property of Group
A group is called morphic if for each normal endomorphism α in end(G),there exists β such that ker(α)= Gβ and Gα= ker(β). In this paper, we consider the case that there exist normal endomorphisms β and γ such that ker(α)= Gβ and Gα = ker(γ). We call G quasi-morphic, if this happens for any normal endomorphism α in end(G). We get the following results: G is quasi-morphic if and only if, for any ...
متن کامل⊂ ⊂ PolyGP : A Polymorphic Genetic Programming System in Haskell
In general, the machine learning process can be accelerated through the use of additional knowledge about the problem solution. For example, mono-morphic typed Genetic Programming (GP) uses type information to reduce the search space and improve performance. Unfortunately, monomorphic typed GP also loses the generality of untyped GP: the generated programs are only suitable for inputs with the ...
متن کاملGeneralizations of Morphic Group Rings
An element a in a ring R is called left morphic if there exists b ∈ R such that 1R(a)= Rb and 1R(b)= Ra. R is called left morphic if every element ofR is left morphic. An element a in a ring R is called left π-morphic (resp., left G-morphic) if there exists a positive integer n such that an (resp., an with an = 0) is left morphic. R is called left π-morphic (resp., left G-morphic) if every elem...
متن کاملUnbounded Iterations of Floor Functions and the Flora Game
Partition the set of games into subsets CompGames and PrimGames, precipitating a new 4-pile take-away game Flora. Let φ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of φ and φ. We use them to formulate an algebraic polynomial-time winning strategy for Flora, and also present recursive, ar...
متن کامل